A Path Clustering Heuristic for Scheduling Task Graphs onto a Grid
نویسندگان
چکیده
منابع مشابه
An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملA Scheduling Approach with Processor and Network Heterogeneity for Grid Environment
Abstract— Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There are no. of scheduling algorithms such as HEFT [1] use mean execution time based b-level for task priority and SHCP [2] use task priority based on simple critical path...
متن کاملMultisite Task Scheduling on Distributed Computing Grid
Multisite task scheduling plays more and more important role in the grid computing as the WAN becomes faster and faster. Through the development of a three-level architecture of the distributed computing grid model and a grid schedule model, a scalable environment for multisite task scheduling is put forward. Then, a multisite Distributed Scheduling Server is designed and its prototype is imple...
متن کاملModels for Scheduling Task Graphs onto Hypercube Systems
Given a set of m tasks with a precedence constraint P and a communication requirement C, where each task has execution time and a subcube requirement, the Hypercube Task Scheduling Problem (HTSP) is to nd an assignment of tasks which minimizes the total completion time. In this paper, we show that HTSP and its many restricted versions are NP-hard. This motivates the development of heuristic alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013